Shape Determination Problem for Minimum Volume Fin

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Shape Design for a Cooling Pin Fin Connection Profil

A shape optimization problem of cooling fins for computer parts and integrated circuits is modeled and solved in this paper. The main purpose is to determine the shape of a two-dimensional pin fin, which leads to the maximum amount of removed heat. To do this, the shape optimization problem is defined as maximizing the norm of the Nusselt number distribution at the boundary of the pin fin's con...

متن کامل

METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...

متن کامل

Maximum Load and Minimum Volume Structural Optimization

A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is als...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Minimum Volume Embedding

Minimum Volume Embedding (MVE) is an algorithm for non-linear dimensionality reduction that uses semidefinite programming (SDP) and matrix factorization to find a low-dimensional embedding that preserves local distances between points while representing the dataset in many fewer dimensions. MVE follows an approach similar to algorithms such as Semidefinite Embedding (SDE), in that it learns a k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series B

سال: 1983

ISSN: 0387-5016,1884-8346

DOI: 10.1299/kikaib.49.695